The combinatorics of some abstract data types

Beyond-Planar Graphs: Algorithmics and Combinatorics

This report summarizes Dagstuhl Seminar 16452 “Beyond-Planar Graphs: Algorithmics and Combinatorics” and documents the talks and discussions. The seminar brought together 29 researchers in the areas of graph theory, combinatorics, computational geometry, and graph drawing. The common interest was in the exploration of structural properties and the development of algorithms for so-called beyond-...

On Kleinewillinghöfer types of finite Laguerre planes with respect to homotheties

Kleinewillinghöfer classified Laguerre planes with respect to central automorphisms and obtained a multitude of types. In this paper we investigate the Kleinewillinghöfer types of finite Laguerre planes with respect to homotheties and deal with some of the larger types.

Genus distributions of orientable embeddings for two types of graphs

Abstract On the basis of the joint tree model introduced by Liu in 2003, the genus distributions of the orientable embeddings for further types of graphs can be obtained. These are apparently not easily obtained using overlap matrices, the formula of Jackson, etc. In this paper, however, by classifying the associated surfaces, we calculate the genus distributions of the orientable embeddings fo...

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

Abstracts of 2007 Combinatorics Workshop Combinatorics Workshop Abstracts of 2007 Combinatorics Workshop